package leetcode;

import org.junit.Test;

/**
 * @author cino
 * justCode
 */
public class leetcode162 {

    @Test
    public void test(){
        int[] nums = new int[]{1,2,3,1,4,2};
        System.out.println(findPeakElement(nums));
    }

    public static int findPeakElement(int[] nums) {
        int left = 0, right = nums.length - 1;
        while(left<right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] > nums[mid + 1]) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }
}
